Real-World Shop Floor Scheduling by Ant Colony Optimization
نویسندگان
چکیده
Email: [email protected] Email: marco. [email protected] Email: [email protected] phone: ++49-371-531 42 52 In order to compare the reached solution quality, we used the mean ow time and the mean lateness of jobs. For the comparison of the results achieved by the means of the Ant Algorithm and other methods we used a priority rule scheduler (PRIORULE) and GACOPA [2]. The priority rule scheduler was allowed to calculate a number of single, standard priority rules (e.g.: shortest processing time, earliest due dates etc.) and combinations of these rules. The best out of the achieved results was used. Manual scheduling achieved a mean lateness of 2.4 days and a mean ow time of 13.2 days.
منابع مشابه
Dynamic and Stochastic Job Shop Scheduling Problems Using Ant Colony Optimization Algorithm
Reactive scheduling is often been criticized for its inability to provide timely optimized and stable schedules. So far, the extant literature has focused on generating schedules that optimize shop floor efficiency. Only a few have considered optimizing both shop floor efficiency and schedule stability. This paper applies a unique selfadaptation mechanism of the ant colony optimization (ACO) al...
متن کاملA Performance Study for the Multi-objective Ant Colony Optimization Algorithms on the Job Shop Scheduling Problem
Most of the research on job shop scheduling problem are concerned with minimization of a single objective. However, the real world applications of job shop scheduling problems are involved in optimizing multiple objectives. Therefore, in recent years ant colony optimization algorithms have been proposed to solve job shop scheduling problems with multiple objectives. In this paper, some recent m...
متن کاملAnt Colony Optimisation for multi-level assembly job shop scheduling
Job shop scheduling is one of the most explored areas in the last few decades. Although it is very commonly witnessed in real-life situations, very less investigation has been carried out in scheduling operations of multi-level jobs, which undergo serial, parallel, and assembly operations in an assembly job shop. In this work, some of the dispatch rules, which have best performances in scheduli...
متن کاملA Hybrid Bacterial Foraging Algorithm For Solving Job Shop Scheduling Problems
Bio-Inspired computing is the subset of Nature-Inspired computing. Job Shop Scheduling Problem is categorized under popular scheduling problems. In this research work, Bacterial Foraging Optimization was hybridized with Ant Colony Optimization and a new technique Hybrid Bacterial Foraging Optimization for solving Job Shop Scheduling Problem was proposed. The optimal solutions obtained by propos...
متن کاملAn Ant Approach to the Flow Shop Problem
In this article we present an Ant Colony Optimization approach to the Flow Shop Problem. ACO is a new algorithmic approach, inspired by the foraging behavior of real ants, that can be applied to the solution of combinatorial optimization problems. Artificial ants are used to construct solutions for Flow Shop Problems that subsequently are improved by a local search procedure. Comparisons with o...
متن کاملFlexible job-shop scheduling with routing flexibility and separable setup times using ant colony optimisation method
This paper proposes an ant colony optimisation-based software system for solving FMS scheduling in a job-shop environment with routing flexibility, sequence-dependent setup and transportation time. In particular, the optimisation problem for a real environment, including parallel machines and operation lag times, has been approached by means of an effective pheromone trail coding and tailored a...
متن کامل